Quantum state transfer on the complete bipartite graph

Previously it was shown that (almost) perfect state transfer can be achieved on the complete bipartite graph by a discrete-time coined quantum walk based algorithm when both sender and receiver vertices are in same partition of opposite partitions size. By changing coin operator, we analyze problem show is still possible to achieve with high fidelity even different sizes. Moreover, also use an active switch approach using lackadaisical walks where marked vertex switched between during algorithm.